Search results for "Geometry of binary search trees"

showing 2 items of 2 documents

On the listing and random generation of hybrid binary trees

1994

We consider in this paper binary trees whose internal nodes are either associative or non-associative. Hybrid binary trees are equivalence classes with respect to the associative property. We count, list and generate randomly hybrid binary trees using Fibonacci numbers.

Discrete mathematicsBinary treeApplied MathematicsWeight-balanced treeScapegoat treeRandom binary treeComputer Science ApplicationsCombinatoricsComputational Theory and MathematicsBinary search treeGeometry of binary search treesTernary search treeBinary expression treeMathematicsInternational Journal of Computer Mathematics
researchProduct

Right-arm rotation distance between binary trees

2003

We consider a transformation on binary trees, named right-arm rotation, which is a special instance of the well-known rotation transformation. Only rotations at nodes of the right arm of the trees are allowed. Using ordinal tools, we give an efficient algorithm for computing the right-arm rotation distance between two binary trees, i.e., the minimum number of rightarm rotations necessary to transform one tree into the other.

Tree rotationBinary treeData_MISCELLANEOUSWeight-balanced treeRandom binary treeComputer Science ApplicationsTheoretical Computer ScienceCombinatoricsBinary search treeGeometry of binary search treesSignal ProcessingTernary search treeRotation (mathematics)Information SystemsMathematicsInformation Processing Letters
researchProduct